Scheduling Control Tasks with Threshold-based Largest Dedication First

نویسندگان

  • Hong Jin
  • Hongan Wang
  • Hui Wang
  • Danli Wang
چکیده

Scheduling design of control tasks with fuzzy deadline is considered. By introducing the dedication concept to describe the scheduling criticality of a control task, the largest dedication first with preemption threshold is presented and the preemption threshold is used to control the context switching among control tasks. Every control task is dynamically assigned its priority and feasible preemption threshold that are dependent on its dedication degree and not restricted by the number of tasks. Simulation shows that the scheduling of controller tasks with fuzzy deadline can get implemented with less control performance cost and better scheduling performance. The proposed concept and scheduling algorithm can be widely applied to the design of computer-controlled systems, enrich researches in control and real-time scheduling theories further, and facilitate the application of real-time control technology.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Title of Dissertation: Dynamic Time-based Scheduling for Hard Real-time Systems Dynamic Time-based Scheduling for Hard Real-time Systems

Title of Dissertation: Dynamic Time-Based Scheduling for Hard Real-Time Systems Seonho Choi, Doctor of Philosophy, 1997 Dissertation directed by: Professor Ashok K. Agrawala Department of Computer Science In traditional time-based scheduling schemes for real-time systems time line is explicitly managed to obtain a feasible schedule that satis es all timing constraints. In the schedule the task ...

متن کامل

CSC 714: Final Project Report

A task scheduling simulator for timing analysis of the various task sets with different scheduling policies was implemented and tested. The simulator supports the various scheduling policies like Rate Monotonic, deadline monotonic and EDF, widely used for scheduling real time applications. It simulates the task execution for the time period, and then it outputs the time based representation of ...

متن کامل

Evaluation of Hft Technique Performance Using Task-scheduling Algorithms

In earlier work we have introduced an efficient hardware fault-tolerant approach for reliable execution of tasks. The proposed approach called the Hardware Fault-Tolerant (HFT) approach. Also, we have introduced the concept of dynamic group maximum matching, which is used to group nodes of a graph into disjoint groups with different sizes dynamically. Furthermore, we have proposed the Dynamic G...

متن کامل

Probabilistic Analysis of Scheduling Precedence Constrained Parallel Tasks on Multicomputers with Contiguous Processor Allocation

ÐGiven a set of precedence constrained parallel tasks with their processor requirements and execution times, the problem of scheduling precedence constrained parallel tasks on multicomputers with contiguous processor allocation is to find a nonpreemptive schedule of the tasks on a multicomputer such that the schedule length is minimized. This scheduling problem is substantially more difficult t...

متن کامل

Optimization of an energy based bi-objective multi skilled resource investment project scheduling problem

Growing concern in the management of energy due to the increasing energy costs, has forced managers to optimize the amount of energy required to provide products and services. This research integrates an energy-based resource investment project-scheduling problem (RIP) under a multi-skilled structure of the resources. The proposed energy based multi skilled resource investment problem (EB-MSRIP...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005